On a Free-Choice Equivalent of a Petri Net
نویسنده
چکیده
A Petri net (PN) 2, 3] is said to be live if it is possible to re any transition from every reachable marking, although not necessarily immediately. In this paper we consider the issue of enforcing liveness in non-live PNs via supervisory control. Using a construction procedure , similar to that in reference 1], that converts an arbitrary PN into an equivalent member of a family of PNs called Free-Choice Petri nets (cf. section 7.2, 3]), we show there is a policy that enforces liveness in the original PN if and only if there is a corresponding policy for its Free-Choice equivalent. The utility of this approach is illustrated via an example.
منابع مشابه
Negotiations and Petri Nets
Negotiations have recently been introduced as a model of concurrency with multi-party negotiation atoms as primitive. This paper studies the relation between negotiations and Petri nets. In particular, we show that each negotiation can be translated into a 1-safe labelled Petri net with equivalent behaviour. In the general case, this Petri net is exponentially larger than the negotiation. For d...
متن کاملFormal approach on modeling and predicting of software system security: Stochastic petri net
To evaluate and predict component-based software security, a two-dimensional model of software security is proposed by Stochastic Petri Net in this paper. In this approach, the software security is modeled by graphical presentation ability of Petri nets, and the quantitative prediction is provided by the evaluation capability of Stochastic Petri Net and the computing power of Markov chain. Each...
متن کاملComplexity Results for 1-safe Nets
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete for 1-safe nets. We also prove that deadlock is NP-complete for free-choice nets and for 1-safe free-choice nets. Finally, we prove that for arbitrary Petri nets, deadlock is equivalent to reachability and liveness.
متن کاملTime Management Approach on a Discrete Event Manufacturing System Modeled by Petri Net
Discrete event system, Supervisory control, Petri Net, Constraint This paper presents a method to manage the time in a manufacturing system for obtaining an optimized model. The system in this paper is modeled by the timed Petri net and the optimization is performed based on the structural properties of Petri nets. In a system there are some states which are called forbidden states an...
متن کاملLinearly Unbounded Timed Petri Nets in Modelling and Performance Evaluation
Linearly unbounded timed Petri nets are free-choice place/transition nets with exponentially distributed firing times associated with transitions of a net, in which the infinite state space is generated by a finite set of linear equations. This linear description can be used for reduction of the infinite state space into an equivalent finite representation that can easily be solved for stationa...
متن کامل